Efficient Delaunay triangulation using rational arithmetic

Constrained Delaunay Triangulation Using Delaunay Visibility

An algorithm for constructing constrained Delaunay triangulation (CDT) of a planar straight-line graph (PSLG) is presented. Although the uniform grid method can reduce the time cost of visibility determinations, the time needed to construct the CDT is still long. The algorithm proposed in this paper decreases the number of edges involved in the computation of visibility by replacing traditional...

Efficient Swarm Neighborhood Management Using the Layered Delaunay Triangulation

Robot Motion Using Delaunay Triangulation

Robot motion is nowadays studied from a lot of different perspectives. This paper is based on the assumption of a fully known environment, allowing the supervisor to plan the robot trajectory before the actual motion. The auxiliary structure we mainly use is the Delaunay triangulation. We analyze the implementation details, as well as the limits of the geometrical model we use.

Constrained Delaunay Triangulation using Plane Subdivision

This paper presents an algorithm for obtaining a constrained Delaunay triangulation from a given planar graph. The main advantage towards other algorithms is that I use an efficient Žalik’s algorithm, using a plane subdivison for obtaining a Delaunay triangulation. It is used for insertion of points into existing triangulation. The other part of algorithm presents a method for inserting edges, ...

An Improved TIN Compression Using Delaunay Triangulation

In this paper we introduce a new compression technique for the connectivity of a Triangulated Irregular Network (TIN) by using Delaunay triangulation. The strategy in this paper is based on that most of 2.5 dimensional terrain connection are very similar to plane-projected Delaunay triangulation of their vertex set. We only need to keep the vertex coordinates and a few edges that are not includ...